Innovation in Leasing and Leasing of Innovation: A Meta-Analysis
نویسندگان
چکیده
منابع مشابه
Asynchronous Leasing
Leasing is a very effective way to improve the performance of distributed algorithms without hampering their fault-tolerance. The notion of lease has traditionally been defined using a global notion of real time and was hence strongly tied to synchronous system models. This paper introduces a notion of lease object devised for an asynchronous system model. We give precise properties of our leas...
متن کاملthe innovation of a statistical model to estimate dependable rainfall (dr) and develop it for determination and classification of drought and wet years of iran
آب حاصل از بارش منبع تأمین نیازهای بی شمار جانداران به ویژه انسان است و هرگونه کاهش در کم و کیف آن مستقیماً حیات موجودات زنده را تحت تأثیر منفی قرار می دهد. نوسان سال به سال بارش از ویژگی های اساسی و بسیار مهم بارش های سالانه ایران محسوب می شود که آثار زیان بار آن در تمام عرصه های اقتصادی، اجتماعی و حتی سیاسی- امنیتی به نحوی منعکس می شود. چون میزان آب ناشی از بارش یکی از مولفه های اصلی برنامه ...
15 صفحه اولFacility Leasing with Penalties
In this paper we study the facility leasing problem with penalties. We present a primaldual algorithm which is a 3-approximation, based on the algorithm by Nagarajan and Williamson for the facility leasing problem [NW13] and on the algorithm by Charikar et al. for the facility location problem with penalties [CKMN01].
متن کاملConnected Facility Leasing Problems
We study leasing variants of the connected facility location problem, in which we wish to connect a set of clients to facilities, and facilities are connected via core edges, whose cost is a scale factor times the cost of a simple edge. We identify two aspects of the problem that can lead to different variants: (a) if there is a single or multiple commodities, and (b) if we lease facilities and...
متن کاملInfrastructure Leasing Problems
Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets Dt ⊆ V for each day t ∈ [T ]. A feasible solution to the problem is a set of edges Et for each t connecting Dt to r. Instead of obtaining edges for a single day at a time, or for infinitely long (both of which give Steiner tree problems), we lease edges for say, { a day, a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Marketing and Management of Innovations
سال: 2020
ISSN: 2227-6718,2218-4511
DOI: 10.21272/mmi.2020.4-16